Waist-size Optimal Parallel Prefix Circuits
نویسندگان
چکیده
A class of parallel algorithms solving the prefix problem on the circuit model are presented. These prefix circuits are problem-size independent, and can be faster than other prefix circuits when the problem size is greater than the circuit width. The prefix circuits are compared analytically with other prefix circuits to show how fast they are.
منابع مشابه
A new approach to the design of optimal parallel prefix circuits
Parallel prefix is one of the fundamental algorithms in computer science. Parallel prefix networks are used to compute carries in fast addition circuits, and have a number of other applications, including the computation of linear recurrences and loop parallelization. A new construction, called Slices, for fan-out-constrained depth size optimal (DSO) parallel prefix circuits is presented. The c...
متن کاملDepth-Size Trade-Offs for Parallel Prefix Computation
A prefix circuit has n inputs xi, . , x, , and computes the n outputs xi 0 . . . 0 xi, i=l , . . , n, where 0 is an associative operation. It is shown that the depth t and the size s of parallel prefix circuits are related by the inequality t + s 2 2n 2. This is true even if arbitrary binary operations can be performed at each node. For 2lgn-2<t<n-loptimalcircuitswith t+s=2n-2arebuilt.Thedepth ...
متن کاملProbabilistic Parallel Prefix Computation
Given inputs ~1,. . . , z,,, which are independent identically distributed random variables over a domain D, and an associative operation o, the probabilistic prej?x computation problem is to compute the product ~1 o x2 o . . . o xn and its n 1 prefixes. Instances of this problem are finite state transductions on random inputs, the addition or subtraction of two random n-bit binary numbers, and...
متن کاملConstructing Zero-deficiency Parallel Prefix Circuits of Minimum Depth
A parallel prefix circuit has n inputs x1, x2, . . . , xn, and computes the n outputs yi = xi • xi−1 • · · ·•x1, 1 ≤ i ≤ n, in parallel, where • is an arbitrary binary associative operator. Snir proved that the depth t and size s of any parallel prefix circuit satisfy the inequality t + s ≥ 2n − 2. Hence, a parallel prefix circuit is said to be of zero-deficiency if equality holds. In this pape...
متن کاملCyclic Segmented Parallel Prefix
The cyclic segmented parallel prefix (CSPP) circuit is a varation on parallel prefix. Whereas ordinary parallel prefix computes prefix sums of a vector from the beginning, CSPP allows the starting point to move arbitrarily, with the data “wrapping around.” The wraparound is widely useful. We have used CSPP to redesign many components of a superscalar processor to run in time logarithmic in the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007